全文获取类型
收费全文 | 2403篇 |
免费 | 159篇 |
国内免费 | 75篇 |
专业分类
化学 | 74篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 31篇 |
数学 | 2428篇 |
物理学 | 99篇 |
出版年
2024年 | 3篇 |
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 45篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 83篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 81篇 |
2013年 | 207篇 |
2012年 | 68篇 |
2011年 | 125篇 |
2010年 | 128篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 139篇 |
2006年 | 146篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 57篇 |
2000年 | 56篇 |
1999年 | 51篇 |
1998年 | 44篇 |
1997年 | 37篇 |
1996年 | 21篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2637条查询结果,搜索用时 15 毫秒
11.
T-型树谱唯一性的一个简单刻画 总被引:1,自引:0,他引:1
图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题. 相似文献
12.
Signed graphs for portfolio analysis in risk management 总被引:1,自引:0,他引:1
Harary Frank; Lim Meng-Hiot; Wunsch Donald C. 《IMA Journal of Management Mathematics》2002,13(3):201-210
We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable. 相似文献
13.
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005 相似文献
14.
A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph. 相似文献
15.
In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.
16.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
17.
18.
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. 相似文献
19.
The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result. 相似文献
20.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献